Cayley Graph Expanders and Groups of Finite Width
نویسنده
چکیده
We present new infinite families of expander graphs of vertex degree 4, which is the minimal possible degree for Cayley graph expanders. Our first family defines a tower of coverings (with covering indices equals 2) and our second family is given as Cayley graphs of finite groups with very short presentations with only 2 generators and 4 relations. Both families are based on particular finite quotients of a group G of infinite upper triangular matrices over the ring M(3,F2). We present explicit vector space bases for the finite abelian quotients of the lower exponent-2 groups of G by upper triangular subgroups and prove a particular 3-periodicity of these quotients. The pro-2 completion of the group G satisfies the Golod-Shafarevich inequality
منابع مشابه
Finite groups admitting a connected cubic integral bi-Cayley graph
A graph is called integral if all eigenvalues of its adjacency matrix are integers. Given a subset $S$ of a finite group $G$, the bi-Cayley graph $BCay(G,S)$ is a graph with vertex set $Gtimes{1,2}$ and edge set ${{(x,1),(sx,2)}mid sin S, xin G}$. In this paper, we classify all finite groups admitting a connected cubic integral bi-Cayley graph.
متن کاملSOME GRAPH PARAMETERS ON THE COMPOSITE ORDER CAYLEY GRAPH
In this paper, the composite order Cayley graph Cay(G, S) is introduced, where G is a group and S is the set of all composite order elements of G. Some graph parameters such as diameter, girth, clique number, independence number, vertex chromatic number and domination number are calculated for the composite order Cayley graph of some certain groups. Moreover, the planarity of composite order Ca...
متن کاملOn the Finite Groups that all Their Semi-Cayley Graphs are Quasi-Abelian
In this paper, we prove that every semi-Cayley graph over a group G is quasi-abelian if and only if G is abelian.
متن کاملOn trivial ends of Cayley graph of groups
In this paper, first we introduce the end of locally finite graphs as an equivalence class of infinite paths in the graph. Then we mention the ends of finitely generated groups using the Cayley graph. It was proved that the number of ends of groups are not depended on the Cayley graph and that the number of ends in the groups is equal to zero, one, two, or infinity. For ...
متن کاملSymmetric Groups and Expanders
We construct an explicit generating sets Fn and F̃n of the alternating and the symmetric groups, which make the Cayley graphs C(Alt(n), Fn) and C(Sym(n), F̃n) a family of bounded degree expanders for all sufficiently large n. These expanders have many applications in the theory of random walks on groups and other areas of mathematics. A finite graph Γ is called an ǫ-expander for some ǫ ∈ (0, 1), ...
متن کامل